Width of a Binary Tree
نویسندگان
چکیده
منابع مشابه
A Note on Tree-width Path-width and Cutwidth*
Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...
متن کاملA note on clique-width and tree-width for structures
We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
متن کاملBounding connected tree-width
Diestel and Müller showed that the connected tree-width of a graph G, i. e., the minimum width of any tree-decomposition with connected parts, can be bounded in terms of the tree-width of G and the largest length of a geodesic cycle in G. We improve their bound to one that is of correct order of magnitude. Finally, we construct a graph whose connected tree-width exceeds the connected order of a...
متن کاملDirected tree-width examples
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k− 1 implies that D has a haven of order k. A negative answer is given. Furthermore they define a generalisation of the robber and cops game of [3] to digraphs. They ask whether it is true that if k cops can catch the robber on a digraph, then they can d...
متن کاملDirected Tree-Width
* Partially supported by NSF under Grant No. DMS-9701598. † Research partially supported by NSF under Grant No. DMS-9401981 and by DIMACS Center, Rutgers University, New Brunswick, NJ 08903. ‡ Partially supported by ONR under Contract No. N00014-97-1-0512. §Partially supported by NSF under Grant No. DMS-9623031, by NSA under Contract No. MDA904-98-1-0517, and by DIMACS Center, Rutgers Universit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/1355-1829